package com.waitingresult.number;

import java.util.TreeSet;

/**
 * @Author: WangShuai
 * @CreateTime: 2024-06-21  17:11
 * @Description:
 * @Version: 1.0
 */
public class MergeNumberArray88 {
    public static void main(String[] args) {

    }

    public int removeDuplicates(int[] nums) {
        //边界条件
        if (nums.length == 0) {
            return 0;
        }
        if (nums.length == 1) {
            return 1;
        }

        TreeSet<Integer> result = new TreeSet<>();
        for (int num : nums) {
            result.add(num);
        }
        Integer i = 0;
        for (Integer value : result) {
            nums[i] = value;
            i++;
        }
        return result.size();

    }


    public void merge(int[] nums1, int m, int[] nums2, int n) {
        int[] result = new int[m + n];

    }
}
